The word problem for 1LC congruences is NP-hard
نویسندگان
چکیده
منابع مشابه
The Sorting Buffer Problem is NP-hard
We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be used to rearrange items. The problem is to design a scheduling strategy that decides upon the order in which items from the buffer are sent to the server. Each ...
متن کاملThe Minimum Latency Problem Is NP-Hard for Weighted Trees
In the minimum latency problem (MLP) we are given n points v1, . . . , vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance from v1 to vi in the tour. The minimum latency problem is MAX-SNP-hard for general metric spaces, but t...
متن کاملUnique Shortest Vector Problem for max norm is NP-hard
The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP. However, so far there is no proof for the proper hardness of uSVP even in its exact version. In this paper, we show that the exact version of uSVP for `∞ norm is NP-hard. Furthermore, many other lattice problems inc...
متن کاملThe Periodic Joint Replenishment Problem is Strongly NP-Hard
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention over the years and many heuristic and approximation algorithms were suggested. However, in spite of the vast effort, the complexity of the problem remained unr...
متن کاملThe real nonnegative inverse eigenvalue problem is NP-hard
A list of complex numbers is realizable if it is the spectrum of a nonnegative matrix. In 1949 Sulěımanova posed the nonnegative inverse eigenvalue problem (NIEP): the problem of determining which lists of complex numbers are realizable. The version for reals of the NIEP (RNIEP) asks for realizable lists of real numbers. In the literature there are many sufficient conditions or criteria for lis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00283-4